Hypergraphs of Bounded Disjointness
نویسندگان
چکیده
A k-uniform hypergraph is s-almost intersecting if every edge is disjoint from exactly s other edges. Gerbner, Lemons, Palmer, Patkós and Szécsi conjectured that for every k, and s > s0(k), every k-uniform s-almost intersecting hypergraph has at most (s + 1) ( 2k−2 k−1 ) edges. We prove a strengthened version of this conjecture and determine the extremal graphs. We also give some related results and conjectures.
منابع مشابه
Polar Decomposition of Order Bounded Disjointness Preserving Operators
We constructively prove (i.e., in ZF set theory) a decomposition theorem for certain order bounded disjointness preserving operators between any two Riesz spaces, real or complex, in terms of the absolute value of another order bounded disjointness preserving operator. In this way, we constructively generalize results by Abramovich, Arensen and Kitover (1992), Grobler and Huijsmans (1997), Hart...
متن کاملA Strongly Diagonal Power of Algebraic Order Bounded Disjointness Preserving Operators
An order bounded disjointness preserving operator T on an Archimedean vector lattice is algebraic if and only if the restriction of Tn! to the vector sublattice generated by the range of Tm is strongly diagonal, where n is the degree of the minimal polynomial of T and m is its ‘valuation’.
متن کاملA lower bound for bounded round quantum communication complexity of set disjointness
We prove a lower bound of Ω ( n k ) for the communication complexity of a k-round two party bounded error quantum protocol with prior entanglement for the set disjointness problem.
متن کامل3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Chvátal, Rödl, Szemerédi and Trotter [1] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hypergraphs. The main new tool which we prove and use is an embedding lemma for 3-uniform hypergraphs of bounded maximum degree into suitable 3-uniform ‘pseudo-random’ hypergraphs. keywords: hypergraphs; regularity lemm...
متن کاملThe Measure of Non-compactness of a Disjointness Preserving Operator
Let E and F be Banach lattices and assume E∗ has no atoms. Let T : E → F be a norm bounded disjointness preserving operator from E into F . Then β(T ) = α(T ) = ‖T‖e = ‖T‖.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 28 شماره
صفحات -
تاریخ انتشار 2014